{ INFORMATICS.MCCME.RU
  Problem statement: http://informatics.mccme.ru/moodle/mod/statements/view3.php?chapterid=310
  Verdict: Accepted
}
var n,i:longint; r:boolean;
begin
reset(input,'input.txt');
rewrite(output,'output.txt');
read(n);
r:=true;
for i:=2 to trunc(sqrt(n))+1 do if (n mod i=0) and (n<>i) then r:=false;
if r then write('prime') else write('composite');
end.